Random semigroup acts on a finite set
نویسندگان
چکیده
منابع مشابه
Iterating Random Functions on a Finite Set
Choose random functions f1, f2, f3, . . . independently and uniformly from among the nn functions from [n] into [n]. For t > 1, let gt = ft ◦ ft−1 ◦ · · · ◦ f1 be the composition of the first t functions, and let T be the smallest t for which gt is constant(i.e. gt(i) = gt(j) for all i, j). The goal of this paper is to determine the asymptotic distribution of T . We prove that, for any positive...
متن کاملLargeness of the Set of Finite Products in a Semigroup
We investigate when the set of finite products of distinct terms of a sequence 〈xn〉n=1 in a semigroup (S, ·) is large in any of several standard notions of largeness. These include piecewise syndetic, central , syndetic, central* , and IP*. In the case of a “nice” sequence in (S, ·) = (N,+) one has that FS(〈xn〉n=1) has any or all of the first three properties if and only if {xn+1 − ∑n t=1 xt : ...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملOn the Cayley Semigroup of a Finite Aperiodic Semigroup
Let S be a finite semigroup. In this paper we introduce the functions φs : S ∗ → S, first defined by Rhodes, given by φs([a1, a2, . . . , an]) = [sa1, sa1a2, . . . , sa1a2 · · · an]. We show that if S is a finite aperiodic semigroup, then the semigroup generated by the functions {φs}s∈S is finite and aperiodic.
متن کاملOn Compositions of Random Functions on a Finite Set
We establish the limiting distribution of the number Tn of random functions on a set of size n which must be composed before a constant function results. In more detail, let f1, f2, . . . be independent draws from the uniform distribution over all functions from {1, . . . , n} into itself. For t = 1, 2, . . . let gt := ft ◦ · · · ◦ f2 ◦ f1 denote the composition of the first t random maps, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1977
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700019637